Lossy Source Compression Using Low-Density Generator Matrix Codes: Analysis and Algorithms
نویسندگان
چکیده
منابع مشابه
Typical Performance of Irregular Low-Density Generator-Matrix Codes for Lossy Compression
We evaluate typical performance of irregular low-density generator-matrix (LDGM) codes, which is defined by sparse matrices with arbitrary irregular bit degree distribution and arbitrary check degree distribution, for lossy compression. We apply the replica method under one-step replica symmetry breaking (1RSB) ansatz to this problem. Typical performance of irregular LDGM codes for lossy compre...
متن کاملBounding Lossy Compression using Lossless Codes at Reduced Precision
An alternative approach to two-part ’critical compression’ is presented. Whereas previous results were based on summing a lossless code at reduced precision with a lossy-compressed error or noise term, the present approach uses a similar lossless code at reduced precision to establish absolute bounds which constrain an arbitrary lossy data compression algorithm applied to the original data.
متن کاملDistributed Lossy Source Coding Using BCH-DFT Codes
Distributed source coding, separate encoding (compression) and joint decoding of statistically dependent sources, arises in an increasing number of applications like sensor networks and multiview video coding. Many of those applications are highly interactive, requiring the development of low-delay, energy-limited communication and computing schemes. Currently, this compression is performed by ...
متن کاملLossy Joint Source-Channel Coding Using Raptor Codes
The straightforward application of Shannon’s separation principle may entail a significant suboptimality in practical systems with limited coding delay and complexity. This is particularly evident when the lossy source code is based on entropy-coded quantization. In fact, it is well known that entropy coding is not robust to residual channel errors. In this paper, a joint source-channel coding ...
متن کاملNovel Lossy Compression Algorithms with Stacked Autoencoders
Lossy compression is a strategy to reduce the size of data while maintaining the majority of its useful or meaningful information. Though some data is lost in the compression process, lossy compression algorithms try to remove data that is unlikely to be considered important by a human consumer. Given this goal, today’s lossy compression techniques are carefully designed to model human percepti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2010
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2009.2039160